Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms
نویسندگان
چکیده
منابع مشابه
On learning context-free and context-sensitive languages
The long short-term memory (LSTM) is not the only neural network which learns a context sensitive language. Second-order sequential cascaded networks (SCNs) are able to induce means from a finite fragment of a context-sensitive language for processing strings outside the training set. The dynamical behavior of the SCN is qualitatively distinct from that observed in LSTM networks. Differences in...
متن کاملSets of Grammars between Context-Free and Context-Sensitive
We discuss some sets of g r a m m a r s whose generat ive power l ies between that of the set of contextf ree g r a m m a r s and that of the set of contextsensit ive g r a m m a r s . These sets a re developed by subjecting genera to rs of context-sensi t ive g r a m m a r s to abs t rac t vers ions of a "hardware" res t r i c t ion to which the u s e r s of natural languages, unlike the d e s...
متن کاملPolynomial Pregroup Grammars parse Context Sensitive Languages
Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, SwissGerman or Old Georgian. A polynomial recogn...
متن کاملEpsilon-Free Grammars and Lexicalized Grammars that Generate the Class of the Mildly Context-Sensitive Languages
This study focuses on the class of string languages generated by TAGs. It examines whether the class of string languages can be generated by some epsilon-free grammars and by some lexicalized grammars. Utilizing spine grammars, this problem is solved positively. This result for spine grammars can be translated into the result for TAGs.
متن کاملCompleteness of Context-Free Grammar Forms
The notions of a grammar form and g-interpretation were first introduced in [2]. However, it quickly became apparent, particularly for EOL forms [5], that (strict) interpretations had a wider interest as well as being better motivated mathematically. The study of parsing of grammar forms detailed in [4], the basic investigation in [8] on linear completeness amongst other results, the study of d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1978
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(78)90799-4